全文获取类型
收费全文 | 5019篇 |
免费 | 385篇 |
国内免费 | 495篇 |
专业分类
化学 | 157篇 |
晶体学 | 1篇 |
力学 | 393篇 |
综合类 | 145篇 |
数学 | 4594篇 |
物理学 | 609篇 |
出版年
2024年 | 6篇 |
2023年 | 71篇 |
2022年 | 71篇 |
2021年 | 89篇 |
2020年 | 139篇 |
2019年 | 132篇 |
2018年 | 141篇 |
2017年 | 153篇 |
2016年 | 146篇 |
2015年 | 106篇 |
2014年 | 228篇 |
2013年 | 384篇 |
2012年 | 184篇 |
2011年 | 286篇 |
2010年 | 249篇 |
2009年 | 300篇 |
2008年 | 304篇 |
2007年 | 332篇 |
2006年 | 334篇 |
2005年 | 306篇 |
2004年 | 220篇 |
2003年 | 212篇 |
2002年 | 235篇 |
2001年 | 189篇 |
2000年 | 166篇 |
1999年 | 177篇 |
1998年 | 126篇 |
1997年 | 114篇 |
1996年 | 98篇 |
1995年 | 82篇 |
1994年 | 66篇 |
1993年 | 44篇 |
1992年 | 34篇 |
1991年 | 16篇 |
1990年 | 25篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 11篇 |
1986年 | 22篇 |
1985年 | 20篇 |
1984年 | 13篇 |
1983年 | 11篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1957年 | 3篇 |
排序方式: 共有5899条查询结果,搜索用时 515 毫秒
61.
We propose a minimum mean absolute error linear interpolator (MMAELI), based on theL
1 approach. A linear functional of the observed time series due to non-normal innovations is derived. The solution equation
for the coefficients of this linear functional is established in terms of the innovation series. It is found that information
implied in the innovation series is useful for the interpolation of missing values. The MMAELIs of the AR(1) model with innovations
following mixed normal andt distributions are studied in detail. The MMAELI also approximates the minimum mean squared error linear interpolator (MMSELI)
well in mean squared error but outperforms the MMSELI in mean absolute error. An application to a real series is presented.
Extensions to the general ARMA model and other time series models are discussed.
This research was supported by a CityU Research Grant and Natural Science Foundation of China. 相似文献
62.
Norman Biggs 《Journal of Combinatorial Theory, Series B》2004,92(2):359
An explicit formula for the chromatic polynomials of certain families of graphs, called bracelets', is obtained. The terms correspond to irreducible representations of symmetric groups. The theory is developed using the standard bases for the Specht modules of representation theory, and leads to an effective means of calculation. 相似文献
63.
Richard Arratia Bla Bollobs Gregory B. Sorkin 《Journal of Combinatorial Theory, Series B》2004,92(2):199-233
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers. 相似文献
64.
Differential FBG sensor for temperature-compensated high-pressure (or displacement) measurement 总被引:2,自引:0,他引:2
A differential fiber Bragg grating (FBG) sensor with a free active element bulk-modulus for high-pressure (or displacement) measurement is presented. Based on the differential measurement method and an isosceles triangle cantilever structure, problems of cross-sensitivity and chirped signal in FBG sensor are improved both theoretically and experimentally. Preliminary experiments indicate that temperature-compensated measurement results agree well with the theoretical analysis. Displacement measurement sensitivity is 1.75 pm/μm, and the estimated pressure measurement resolution can reach 0.27 MPa in case the wavelength shift measurement resolution is 0.01 nm. 相似文献
65.
66.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
67.
Summary By employing a novel idea and simple techniques, we substantially generalize the Turán type inequality for rational functions
with real zeros and prescribed poles established by Min [5] to include Lpspaces for 1≤p≤∞<span style='font-size:10.0pt'>while loosing the restriction ρ > 2 at the same time. 相似文献
68.
Johan van Benthem 《Logica Universalis》2007,1(1):125-138
We prove new Lindstr?m theorems for the basic modal propositional language, and for some related fragments of first-order
logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference
between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections
with interpolation properties, and the modal invariance theorem.
Mathematics Subject Classification (2000): Primary 03B45; Secondary 03C95 相似文献
69.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
70.
卢琳璋 《高等学校计算数学学报(英文版)》1994,(1)
The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper. 相似文献